3 Conservative Logic
نویسنده
چکیده
Conservative logic is a comprehensive model of computation which explicitly reflects a number of fundamental principles of physics, such as the reversibility of the dynamical laws and the conservation of certain additive quantities (among which energy plays a distinguished role). Because it more closely mirrors physics than traditional models of computation, conservative logic is in a better position to provide indications concerning the realization of high-performance computing systems, i.e., of systems that make very efficient use of the "computing resources" actually offered by nature. In particular, conservative logic shows that it is ideally possible to build sequential circuits with zero internal power dissipation. After establishing a general framework, we discuss two specific models of computation. The first uses binary variables and is the conservative-logic counterpart of switching theory; this model proves that universal computing capabilities are compatible with the reversibility and conservation constraints. The second model, which is a refinement of the first, constitutes a substantial breakthrough in establishing a correspondence between computation and physics. In fact, this model is based on elastic collisions of identical "balls" and thus is formally identical with the atomic model that underlies the (classical) kinetic theory of perfect gases. Quite literally, the functional behavior of a general-purpose digital computer can be reproduced by a perfect gas placed in a suitably shaped container and given appropriate initial conditions.
منابع مشابه
Conservative Expansion Concepts for Default Theories
Conservative extensions of logical theories play an important role in software engineering. They provide a formal basis for program reenement and guarantee the integrity and transparency of modules and objects. This paper studies conservative extension ideas in the context of default logic. In particular, we deene several alternative concepts, study their properties, and derive interconnections...
متن کاملConservative Extensions in the Lightweight Description Logic EL
We bring together two recent trends in description logic (DL): lightweight DLs in which the subsumption problem is tractable and conservative extensions as a central tool for formalizing notions of ontology design such as refinement and modularity. Our aim is to investigate conservative extensions as an automated reasoning problem for the basic tractable DL EL. The main result is that deciding ...
متن کاملNatural Deduction for Intuitionistic Non-communicative Linear Logic
We present a system of natural deduction and associated term calculus for intuitionistic non-commutative linear logic (INCLL) as a conservative extension of intuitionistic linear logic. We prove subject reduction and the existence of canonical forms in the implicational fragment.
متن کاملFirst-Order Modular Logic Programs and their Con: set servative Extensions
Modular logic programs provide a way of viewing logic programs as consisting of many independent, meaningful modules. This paper introduces first-order modular logic programs, which can capture the meaning of many answer set programs. We also introduce conservative extensions of such programs. This concept helps to identify strong relationships between modular programs as well as between tradit...
متن کاملPartial Correctness Assertions Provable in Dynamic Logics
We consider a formalism DL for first order Dynamic Logic, based on Segerberg’s axioms for modalities, and observe that DL is not conservative over Hoare Logic (HL) when the background theory is empty, but is conservative if the background theory is the complete theory of an expressive structure (in the sense of Cook). We identify Peano Arithmetic (PA) as the transition point between these two s...
متن کاملConservative Retractions of Propositional Logic Theories by Means of Boolean Derivatives: Theoretical Foundations
We present a specialised (polynomial-based) rule for the propositional logic called the Independence Rule, which is useful to compute the conservative retractions of propositional logic theories. In this paper we show the soundness and completeness of the logical calculus based on this rule, as well as other applications. The rule is defined by means of a new kind of operator on propositional f...
متن کامل